Termination w.r.t. Q proof of TRS/higher-order/AotoYam016.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

Q is empty.

↳ QTRS

  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

The set Q consists of the following terms:

app(app(neq, 0), 0)
app(app(neq, 0), app(s, x0))
app(app(neq, app(s, x0)), 0)
app(app(neq, app(s, x0)), app(s, x1))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))
nonzero

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(neq, app(s, x)), app(s, y)) → APP(neq, x)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(cons, y), app(app(filter, f), ys))
NONZERO → APP(neq, 0)
APP(app(filter, f), app(app(cons, y), ys)) → APP(filtersub, app(f, y))
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(filtersub, app(f, y)), f)
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)
APP(app(neq, app(s, x)), app(s, y)) → APP(app(neq, x), y)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
NONZERO → APP(filter, app(neq, 0))

The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

The set Q consists of the following terms:

app(app(neq, 0), 0)
app(app(neq, 0), app(s, x0))
app(app(neq, app(s, x0)), 0)
app(app(neq, app(s, x0)), app(s, x1))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))
nonzero

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(neq, app(s, x)), app(s, y)) → APP(neq, x)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(cons, y), app(app(filter, f), ys))
NONZERO → APP(neq, 0)
APP(app(filter, f), app(app(cons, y), ys)) → APP(filtersub, app(f, y))
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(filtersub, app(f, y)), f)
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)
APP(app(neq, app(s, x)), app(s, y)) → APP(app(neq, x), y)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
NONZERO → APP(filter, app(neq, 0))

The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

The set Q consists of the following terms:

app(app(neq, 0), 0)
app(app(neq, 0), app(s, x0))
app(app(neq, app(s, x0)), 0)
app(app(neq, app(s, x0)), app(s, x1))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))
nonzero

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(cons, y), app(app(filter, f), ys))
APP(app(neq, app(s, x)), app(s, y)) → APP(neq, x)
NONZERO → APP(neq, 0)
APP(app(filter, f), app(app(cons, y), ys)) → APP(filtersub, app(f, y))
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(filtersub, app(f, y)), f)
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(neq, app(s, x)), app(s, y)) → APP(app(neq, x), y)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
NONZERO → APP(filter, app(neq, 0))

The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

The set Q consists of the following terms:

app(app(neq, 0), 0)
app(app(neq, 0), app(s, x0))
app(app(neq, app(s, x0)), 0)
app(app(neq, app(s, x0)), app(s, x1))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))
nonzero

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 8 less nodes.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(neq, app(s, x)), app(s, y)) → APP(app(neq, x), y)

The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

The set Q consists of the following terms:

app(app(neq, 0), 0)
app(app(neq, 0), app(s, x0))
app(app(neq, app(s, x0)), 0)
app(app(neq, app(s, x0)), app(s, x1))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))
nonzero

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

NEQ(s(x), s(y)) → NEQ(x, y)

R is empty.
The set Q consists of the following terms:

neq(0, 0)
neq(0, s(x0))
neq(s(x0), 0)
neq(s(x0), s(x1))
filter(x0, nil)
filter(x0, cons(x1, x2))
filtersub(true, x0, cons(x1, x2))
filtersub(false, x0, cons(x1, x2))
nonzero

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(neq, app(s, x)), app(s, y)) → APP(app(neq, x), y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
NEQ(x1, x2) = NEQ(x1)
s(x1) = s(x1)

Recursive path order with status [2].
Quasi-Precedence:

[NEQ₁, s_1]

Status:

s₁: multiset
NEQ₁: multiset

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

The set Q consists of the following terms:

app(app(neq, 0), 0)
app(app(neq, 0), app(s, x0))
app(app(neq, app(s, x0)), 0)
app(app(neq, app(s, x0)), app(s, x1))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))
nonzero

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))

The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

The set Q consists of the following terms:

app(app(neq, 0), 0)
app(app(neq, 0), app(s, x0))
app(app(neq, app(s, x0)), 0)
app(app(neq, app(s, x0)), app(s, x1))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))
nonzero

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)

The remaining pairs can at least be oriented weakly.

APP(app(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))

Used ordering: Combined order from the following AFS and order.
APP(x1, x2) = APP(x2)
app(x1, x2) = app(x1, x2)
filtersub = filtersub
false = false
cons = cons
filter = filter
true = true
neq = neq
s = s
nil = nil
0 = 0

Recursive path order with status [2].
Quasi-Precedence:

[APP₁, filtersub] > [false, cons, filter] > [app₂, nil]
neq > true > [app₂, nil]

Status:

APP₁: [1]
filter: multiset
true: multiset
neq: multiset
filtersub: multiset
false: multiset
app₂: multiset
0: multiset
s: multiset
nil: multiset
cons: multiset

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))

The TRS R consists of the following rules:

app(app(neq, 0), 0) → false
app(app(neq, 0), app(s, y)) → true
app(app(neq, app(s, x)), 0) → true
app(app(neq, app(s, x)), app(s, y)) → app(app(neq, x), y)
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)
nonzero → app(filter, app(neq, 0))

The set Q consists of the following terms:

app(app(neq, 0), 0)
app(app(neq, 0), app(s, x0))
app(app(neq, app(s, x0)), 0)
app(app(neq, app(s, x0)), app(s, x1))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))
nonzero

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.